Intrinsic Linking and Knotting Are Arbitrarily Complex
نویسندگان
چکیده
We show that, given any n and α, every embedding of any sufficiently large complete graph in R contains an oriented link with components Q1, . . . , Qn such that for every i 6= j, |lk(Qi, Qj)| ≥ α and |a2(Qi)| ≥ α, where a2(Qi) denotes the second coefficient of the Conway polynomial of Qi.
منابع مشابه
Intrinsic Linking and Knotting of Graphs
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper. Four graphs are established to be minor minimal intrinsically even linked, and it is conjectured that they form a complete minor minimal set. Some characterizations are given, using the simplest of the four graphs as an integral part of the arguments, that may be useful in proving the conjecture...
متن کاملIntrinsic Linking and Knotting in Virtual Spatial Graphs
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several examples of intrinsically virtually linked and knotted graphs. As a byproduct, ...
متن کاملD ec 2 00 6 INTRINSIC LINKING IS ARBITRARILY COMPLEX
We prove that given any n, λ ∈ N, there is a graph G which has the property that every embedding of G in R contains an ncomponent link all of whose components are pairwise linked with linking number greater than λ.
متن کاملIntrinsic Linking Is Arbitrarily Complex
We prove that given any n, λ ∈ N, there is a graph G which has the property that every embedding of G in R contains an n-component link all of whose components are pairwise linked with linking number greater than λ.
متن کامل